1783D - Different Arrays - CodeForces Solution


brute force dp implementation

Please click on ads to support us..

Python Code:

def main():

    MOD = 998244353
    n = int(input())
    a = readIntArr()

        
        offset = 100000
    dp = [0] * 200000      dp[offset + a[1]] = 1
    for i in range(1, n - 1):
                dp2 = [0] * 200000
        for v in range(-90000, 90000):
            if -100000 < a[i + 1] + v < 100000:
                dp2[offset + a[i + 1] + v] = (dp2[offset + a[i + 1] + v] + dp[offset + v]) % MOD
            if v != 0 and -100000 < a[i + 1] - v < 100000:
                dp2[offset + a[i + 1] - v]
                dp2[offset + a[i + 1] - v] = (dp2[offset + a[i + 1] - v] + dp[offset + v]) % MOD
        dp = dp2
    ans = 0
    for cnts in dp:
        ans += cnts
        ans %= MOD
    print(ans)

        
    return

import sys
input=sys.stdin.buffer.readline  
def oneLineArrayPrint(arr):
    print(' '.join([str(x) for x in arr]))
def multiLineArrayPrint(arr):
    print('\n'.join([str(x) for x in arr]))
def multiLineArrayOfArraysPrint(arr):
    print('\n'.join([' '.join([str(x) for x in y]) for y in arr]))
 
def readIntArr():
    return [int(x) for x in input().split()]
 
def makeArr(defaultValFactory,dimensionArr):     dv=defaultValFactory;da=dimensionArr
    if len(da)==1:return [dv() for _ in range(da[0])]
    else:return [makeArr(dv,da[1:]) for _ in range(da[0])]
 
def queryInteractive(a, b):
    print('? {} {}'.format(a, b))
    sys.stdout.flush()
    return int(input())
 
def answerInteractive(ans):
    print('! {}'.format(ans))
    sys.stdout.flush()
 
inf=float('inf')
 
from math import gcd,floor,ceil
import math
 
for _abc in range(1):
    main()

C++ Code:

#include <bits/stdc++.h>
#include<fstream>
using namespace std;
#define MAX 100'005
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define tii tuple<int, int, int>
#define tiii tuple<int, int, int, int>
const int MOD = 998244353;

int a[301][301*301*2];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int tt = 1;
//    ifstream fin;
//    fin.open("input.txt");
//    cout<<fixed;
//    cout.precision(15);
//    cin >> tt;
    while(tt--) {
        int n;
        cin >> n;
        vector<int> v(n);
        for(int i=0; i<n; i++){
            cin >> v[i];
        }
        a[1][v[1]+300*301]=1;
        for(int i=1; i<n-1; i++){
            for(int j=0; j<301*301*2; j++){
                if(a[i][j]>0){
                    int x = j-301*300;
                    if(x == 0){
                        a[i+1][v[i+1]+300*301]=(a[i+1][v[i+1]+300*301]+a[i][j])%MOD;
                    }
                    else{
                        a[i+1][v[i+1]+x+300*301] = (a[i+1][v[i+1]+x+300*301]+a[i][j])%MOD;
                        a[i+1][v[i+1]-x+300*301] = (a[i+1][v[i+1]-x+300*301]+a[i][j])%MOD;
                    }
                }
            }
        }
        ll ans = 0;
        for(int i=0; i<301*301*2; i++){
            if(a[n-1][i]>0){
                ans = (ans+a[n-1][i])%MOD;
            }
        }
        cout << ans << '\n';
    }
}


Comments

Submit
0 Comments
More Questions

515A - Drazil and Date
1084B - Kvass and the Fair Nut
1101A - Minimum Integer
985D - Sand Fortress
1279A - New Year Garland
1279B - Verse For Santa
202A - LLPS
978A - Remove Duplicates
1304A - Two Rabbits
225A - Dice Tower
1660D - Maximum Product Strikes Back
1513A - Array and Peaks
1251B - Binary Palindromes
768B - Code For 1
363B - Fence
991B - Getting an A
246A - Buggy Sorting
884A - Book Reading
1180A - Alex and a Rhombus
445A - DZY Loves Chessboard
1372A - Omkar and Completion
159D - Palindrome pairs
981B - Businessmen Problems
1668A - Direction Change
1667B - Optimal Partition
1668B - Social Distance
88B - Keyboard
580B - Kefa and Company
960A - Check the string
1220A - Cards